Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures

According to the clan decomposition theorem of Ehrenfeucht and Rozenberg (1990) each labeled 2-structure has a decomposition into three types of basic 2-structures: complete, linear and primitive. This decomposition tan be expressed as a node labeled tree, the shape of the 2-structure. Our main interest is in the uniformly nonprimitive 2-structures, which do not have primitive substructures. Every (directed) graph tan be considered as a restricted 2-strncture with only two labels (arc, no-arc). It is proved that forbidding primitivity in the 2-strnctures gives a unified approach to some well-known classes of graphs, viz., the cographs and the transitive vertex series-parallel graphs. We also study the parallel complexity of the decomposition of 2-structnres. It is shown that there is a LOGCF algorithm, which recognizes the uniformly nonprimitive 2-structures and constructs their shapes. We prove also that for every MS0 (monadic second-Order) definable property of 2-structures, there is a LOGCF algorithm to decide whether or not a uniformly nonprimitive 2-structure has that property.